Modeling Interacting Galaxies Using a Parallel Genetic Algorithm

نویسنده

  • Christian Theis
چکیده

Modeling of interacting galaxies suffers from an extended parameter space prohibiting traditional grid based search strategies. As an alternative approach a combination of a Genetic Algorithm (GA) with fast restricted N-body simulations can be applied. A typical fit takes about 3–6 CPU-hours on a PentiumII processor. Here we present a parallel implementation of our GA which reduces the CPU-requirement of a parameter determination to a few minutes on 100 nodes of a CRAY T3E.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

MATHEMATICAL MODELING AND PERFORMANCE OPTIMIZATION FOR THE DIGESTING SYSTEM OF A PAPER PLANT

This paper deals with the mathematical modeling and performance optimization for the Digesting system of a Paper Plant using Genetic Algorithm. The Digesting system of a Paper Plant has four main subsystems, arranged in series and parallel. Considering exponential distribution for the probable failures and repairs, the mathematical formulation of the problem is done using probabilistic approach...

متن کامل

Performance Analysis of Screening Unit in a Paper Plant Using Genetic Algorithm

This paper deals with the performance analysis of the screening unit in a paper plant using Genetic Algorithm. The screening unit in the paper plant has four main subsystems. These subsystems are arranged in series and parallel configurations. Considering exponential distribution for the probable failures and repairs, the mathematical formulation of the problem is done by Markov birth-death pro...

متن کامل

Static Task Allocation in Distributed Systems Using Parallel Genetic Algorithm

Over the past two decades, PC speeds have increased from a few instructions per second to several million instructions per second. The tremendous speed of today's networks as well as the increasing need for high-performance systems has made researchers interested in parallel and distributed computing. The rapid growth of distributed systems has led to a variety of problems. Task allocation is a...

متن کامل

Parallel Genetic Algorithm Using Algorithmic Skeleton

Algorithmic skeleton has received attention as an efficient method of parallel programming in recent years. Using the method, the programmer can implement parallel programs easily. In this study, a set of efficient algorithmic skeletons is introduced for use in implementing parallel genetic algorithm (PGA).A performance modelis derived for each skeleton that makes the comparison of skeletons po...

متن کامل

Parallel Genetic Algorithm Using Algorithmic Skeleton

Algorithmic skeleton has received attention as an efficient method of parallel programming in recent years. Using the method, the programmer can implement parallel programs easily. In this study, a set of efficient algorithmic skeletons is introduced for use in implementing parallel genetic algorithm (PGA).A performance modelis derived for each skeleton that makes the comparison of skeletons po...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999